Flowshop problem F2 →D|v= 1,c≥ 1|Cmax revisited
نویسندگان
چکیده
منابع مشابه
F2 Lanczos revisited
We present a new variant of the block Lanczos algorithm for finding vectors in the kernel of a symmetric matrix over F2. Our algorithm is at least as efficient as that of Peter Montgomery [6], while the sequence of matrices Wi constructed here have different algebraic properties that may be useful in eventually providing a provable upper bound on the time required to solve this problem. Namely,...
متن کاملComputational results for the flowshop tardiness problem
This paper reports on computational experiments involving optimal solutions to the flowshop tardiness problem. Of primary interest was a generic approach: solutions were obtained using a spreadsheet-based, mixed-integer programming code. However, the results compare favorably with those from a specially-tailored branch and bound algorithm. The main implication is that hardware and software have...
متن کاملThe distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملSolving polynomial systems with noise over F2: Revisited
Solving polynomial systems with noise over F2 is a fundamental problem in computer science, especially in cryptanalysis. ISBS is a new method for solving this problem based on the idea of incrementally solving the noisy polynomial systems and backtracking all the possible noises. It had better performance than other methods in solving the Cold Boot Key recovery problem. In this paper, some furt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.01.018